SherbyNet - /page/wikibook/entry.mu

Micron Document

<!DOCTYPE html>

<title>Nigel Smart (cryptographer)</title>

</head>

<span id="openzim-page-title" class="mw-page-title-main"><span class="mw-page-title-main">Nigel Smart (cryptographer)</span></span>

</h1>

</header>

</p>

/* start https://en.wikipedia.org/ */

.mw-parser-output .infobox-subbox{padding:0;border:none;margin:-3px;width:auto;min-width:100%;font-size:100%;clear:none;float:none;background-color:transparent}.mw-parser-output .infobox-3cols-child{margin:auto}.mw-parser-output .infobox .navbar{font-size:100%}@media screen{html.skin-theme-clientpref-night .mw-parser-output .infobox-full-data:not(.notheme)>div:not(.notheme)[style]{background:#1f1f23!important;color:#f8f9fa}}@media screen and (prefers-color-scheme:dark){html.skin-theme-clientpref-os .mw-parser-output .infobox-full-data:not(.notheme)>div:not(.notheme)[style]{background:#1f1f23!important;color:#f8f9fa}}@media(min-width:640px){body.skin--responsive .mw-parser-output .infobox-table{display:table!important}body.skin--responsive .mw-parser-output .infobox-table>caption{display:table-caption!important}body.skin--responsive .mw-parser-output .infobox-table>tbody{display:table-row-group}body.skin--responsive .mw-parser-output .infobox-table th,body.skin--responsive .mw-parser-output .infobox-table td{padding-left:inherit;padding-right:inherit}}

/* end https://en.wikipedia.org/ */

</style><table class="infobox biography vcard"><tbody><tr><th colspan="2" class="infobox-above" style="font-size:125%;"><div class="fn">Nigel Smart</div></th></tr><tr><th scope="row" class="infobox-label">Born</th><td class="infobox-data"><span style="display:none"> (<span class="bday">1967-10-22</span>) </span>22 October 1967<br><div style="display:inline" class="birthplace"><a href="United_Kingdom" title="United Kingdom">United Kingdom</a></div></td></tr><tr><th scope="row" class="infobox-label">Alma mater</th><td class="infobox-data"><style data-mw-deduplicate="TemplateStyles:r1126788409">

/* start https://en.wikipedia.org/ */

.mw-parser-output .plainlist ol,.mw-parser-output .plainlist ul{line-height:inherit;list-style:none;margin:0;padding:0}.mw-parser-output .plainlist ol li,.mw-parser-output .plainlist ul li{margin-bottom:0}

/* end https://en.wikipedia.org/ */

</style><div class="plainlist">

<ul><li><a href="University_of_Reading" title="University of Reading">University of Reading</a> (BSc)</li>

<li><a href="University_of_Kent" title="University of Kent">University of Kent</a> (PhD)</li></ul>

</div></td></tr><tr><th scope="row" class="infobox-label">Known for</th><td class="infobox-data"><a href="Elliptic_curve_cryptography" class="mw-redirect" title="Elliptic curve cryptography">ECC</a><br>Work on the <a href="ECDLP" class="mw-redirect" title="ECDLP">ECDLP</a> problem<br><a href="Pairing-based_cryptography" title="Pairing-based cryptography">Pairing-based cryptography</a><br>Efficient <a href="Secure_multi-party_computation" title="Secure multi-party computation">Secure multi-party computation</a><br> Fully <a href="Homomorphic_encryption" title="Homomorphic encryption">homomorphic encryption</a></td></tr><tr><td colspan="2" class="infobox-full-data"><b>Scientific career</b></td></tr><tr><th scope="row" class="infobox-label">Fields</th><td class="infobox-data category"><a href="Cryptography" title="Cryptography">Cryptography</a></td></tr><tr><th scope="row" class="infobox-label">Institutions</th><td class="infobox-data"><a href="Katholieke_Universiteit_Leuven" class="mw-redirect" title="Katholieke Universiteit Leuven">Katholieke Universiteit Leuven</a></td></tr><tr><th scope="row" class="infobox-label"><a href="Doctoral_advisor" title="Doctoral advisor">Doctoral advisor</a></th><td class="infobox-data">John Merriman</td></tr><tr style="display:none"><td colspan="2">

</td></tr><tr><th scope="row" class="infobox-label">Website</th><td class="infobox-data"><span class="url"><a rel="nofollow" class="external text" href="https://nigelsmart.github.io/">nigelsmart<wbr>.github<wbr>.io</a></span></td></tr></tbody></table>

<p><b>Nigel Smart</b> is a professor at <a href="COSIC" title="COSIC">COSIC</a> at the <a href="Katholieke_Universiteit_Leuven" class="mw-redirect" title="Katholieke Universiteit Leuven">Katholieke Universiteit Leuven</a> and Chief Academic Officer at Zama.<sup id="cite_ref-1" class="reference"><a href="#cite_note-1"><span class="cite-bracket">[</span>1<span class="cite-bracket">]</span></a></sup> He is a cryptographer with interests in the theory of cryptography and its application in practice.<sup id="cite_ref-2" class="reference"><a href="#cite_note-2"><span class="cite-bracket">[</span>2<span class="cite-bracket">]</span></a></sup><sup id="cite_ref-3" class="reference"><a href="#cite_note-3"><span class="cite-bracket">[</span>3<span class="cite-bracket">]</span></a></sup>

</p>

<div class="mw-heading mw-heading2"><h2 id="Education">Education</h2></div>

<p>Smart received a <a href="BSc_degree" class="mw-redirect" title="BSc degree">BSc degree</a> in <a href="Mathematics" title="Mathematics">mathematics</a> from the <a href="University_of_Reading" title="University of Reading">University of Reading</a> in 1989. He then obtained his <a href="PhD_degree" class="mw-redirect" title="PhD degree">PhD degree</a> from the <a href="University_of_Kent" title="University of Kent">University of Kent</a> at <a href="Canterbury" title="Canterbury">Canterbury</a> in 1992; his thesis was titled <i>The Computer Solutions of Diophantine Equations</i>.

</p>

<div class="mw-heading mw-heading2"><h2 id="Career">Career</h2></div>

<p>Smart proceeded to work as a <a href="Research_fellow" title="Research fellow">research fellow</a> at the University of Kent, the <a href="Erasmus_University_Rotterdam" title="Erasmus University Rotterdam">Erasmus University Rotterdam</a>, and <a href="Cardiff_University" title="Cardiff University">Cardiff University</a> until 1995. From 1995 to 1997, he was a lecturer in mathematics at the University of Kent, and then spent three years in industry at <a href="Hewlett-Packard" title="Hewlett-Packard">Hewlett-Packard</a> from 1997 to 2000. From 2000 to 2017 he was at the University of Bristol, where he founded the cryptology research group. From 2018 he has been based in the COSIC group at the Katholieke Universiteit Leuven, where he is now a part-time professor.

</p><p>Smart held a <a href="Royal_Society" title="Royal Society">Royal Society</a> Wolfson Merit Award (2008–2013), and two <a href="European_Research_Council" title="European Research Council">ERC</a> Advanced Grant (2011–2016 and 2016-2021). He was a director of the <a href="International_Association_for_Cryptologic_Research" title="International Association for Cryptologic Research">International Association for Cryptologic Research</a> (2012–2014), and was elected vice president for the period 2014-2016.<sup id="cite_ref-4" class="reference"><a href="#cite_note-4"><span class="cite-bracket">[</span>4<span class="cite-bracket">]</span></a></sup> In 2016 he was named as a Fellow of the IACR.<sup id="cite_ref-5" class="reference"><a href="#cite_note-5"><span class="cite-bracket">[</span>5<span class="cite-bracket">]</span></a></sup>

</p>

<div class="mw-heading mw-heading2"><h2 id="Research">Research</h2></div>

<p>Prof. Smart is best known for his work in <a href="Elliptic_curve_cryptography" class="mw-redirect" title="Elliptic curve cryptography">elliptic curve cryptography</a>, especially work on the <a href="ECDLP" class="mw-redirect" title="ECDLP">ECDLP</a>.<sup id="cite_ref-6" class="reference"><a href="#cite_note-6"><span class="cite-bracket">[</span>6<span class="cite-bracket">]</span></a></sup><sup id="cite_ref-7" class="reference"><a href="#cite_note-7"><span class="cite-bracket">[</span>7<span class="cite-bracket">]</span></a></sup><sup id="cite_ref-8" class="reference"><a href="#cite_note-8"><span class="cite-bracket">[</span>8<span class="cite-bracket">]</span></a></sup> He has also worked on <a href="Pairing-based_cryptography" title="Pairing-based cryptography">pairing-based cryptography</a> contributing a number of algorithms such as the <a href="SK-KEM" class="mw-redirect" title="SK-KEM">SK-KEM</a><sup id="cite_ref-9" class="reference"><a href="#cite_note-9"><span class="cite-bracket">[</span>9<span class="cite-bracket">]</span></a></sup> and the Ate-pairing<sup id="cite_ref-10" class="reference"><a href="#cite_note-10"><span class="cite-bracket">[</span>10<span class="cite-bracket">]</span></a></sup>

</p><p>Smart carries out research on a wide variety of topics in cryptography. He has been instrumental in the effort to make secure multiparty computation practical. A few of his works in this direction include.<sup id="cite_ref-11" class="reference"><a href="#cite_note-11"><span class="cite-bracket">[</span>11<span class="cite-bracket">]</span></a></sup><sup id="cite_ref-12" class="reference"><a href="#cite_note-12"><span class="cite-bracket">[</span>12<span class="cite-bracket">]</span></a></sup><sup id="cite_ref-13" class="reference"><a href="#cite_note-13"><span class="cite-bracket">[</span>13<span class="cite-bracket">]</span></a></sup>

</p><p>His work with Gentry and Halevi on performing the first large calculation using Fully Homomorphic Encryption<sup id="cite_ref-14" class="reference"><a href="#cite_note-14"><span class="cite-bracket">[</span>14<span class="cite-bracket">]</span></a></sup> won the <a href="IBM" title="IBM">IBM</a> <i>Pat Goldberg Best Paper Award</i> for 2012.<sup id="cite_ref-15" class="reference"><a href="#cite_note-15"><span class="cite-bracket">[</span>15<span class="cite-bracket">]</span></a></sup>

</p><p>In addition to his three years at <a href="HP_Laboratories" class="mw-redirect" title="HP Laboratories">HP Laboratories</a>, Smart was a founder of the startup Identum specialising in pairing based cryptography and identity based encryption. This was bought by <a href="Trend_Micro" title="Trend Micro">Trend Micro</a> in 2008.<sup id="cite_ref-16" class="reference"><a href="#cite_note-16"><span class="cite-bracket">[</span>16<span class="cite-bracket">]</span></a></sup> In 2013 he formed, with <a href="Yehuda_Lindell" title="Yehuda Lindell">Yehuda Lindell</a>, Unbound Security (formally called Dyadic Security), a company focusing on deploying distributed cryptographic solutions based on multi-party computations. Unbound Security was bought by Coinbase in 2021.<sup id="cite_ref-17" class="reference"><a href="#cite_note-17"><span class="cite-bracket">[</span>17<span class="cite-bracket">]</span></a></sup> He is also the co-founder, along with <a href="Kenny_Paterson" title="Kenny Paterson">Kenny Paterson</a>, of the <a href="Real_World_Crypto" class="mw-redirect" title="Real World Crypto">Real World Crypto</a> conference series.<sup id="cite_ref-18" class="reference"><a href="#cite_note-18"><span class="cite-bracket">[</span>18<span class="cite-bracket">]</span></a></sup>

</p>

<div class="mw-heading mw-heading3"><h3 id="Publications">Publications</h3></div>

/* start https://en.wikipedia.org/ */

.mw-parser-output cite.citation{font-style:inherit;word-wrap:break-word}.mw-parser-output .citation q{quotes:"\"""\"""'""'"}.mw-parser-output .citation:target{background-color:rgba(0,127,255,0.133)}.mw-parser-output .id-lock-free.id-lock-free a{background:url("./mw/Lock-green.svg")right 0.1em center/9px no-repeat}.mw-parser-output .id-lock-limited.id-lock-limited a,.mw-parser-output .id-lock-registration.id-lock-registration a{background:url("./mw/Lock-gray-alt-2.svg")right 0.1em center/9px no-repeat}.mw-parser-output .id-lock-subscription.id-lock-subscription a{background:url("./mw/Lock-red-alt-2.svg")right 0.1em center/9px no-repeat}.mw-parser-output .cs1-ws-icon a{background:url("./mw/Wikisource-logo.svg")right 0.1em center/12px no-repeat}body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-free a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-limited a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-registration a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-subscription a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .cs1-ws-icon a{background-size:contain;padding:0 1em 0 0}.mw-parser-output .cs1-code{color:inherit;background:inherit;border:none;padding:inherit}.mw-parser-output .cs1-hidden-error{display:none;color:var(--color-error,#d33)}.mw-parser-output .cs1-visible-error{color:var(--color-error,#d33)}.mw-parser-output .cs1-maint{display:none;color:#085;margin-left:0.3em}.mw-parser-output .cs1-kern-left{padding-left:0.2em}.mw-parser-output .cs1-kern-right{padding-right:0.2em}.mw-parser-output .citation .mw-selflink{font-weight:inherit}@media screen{.mw-parser-output .cs1-format{font-size:95%}html.skin-theme-clientpref-night .mw-parser-output .cs1-maint{color:#18911f}}@media screen and (prefers-color-scheme:dark){html.skin-theme-clientpref-os .mw-parser-output .cs1-maint{color:#18911f}}

/* end https://en.wikipedia.org/ */

</style><cite id="CITEREFNigel_P._Smart1998" class="citation book cs1">Nigel P. Smart (1998). <span class="id-lock-registration" title="Free registration required"><a rel="nofollow" class="external text" href="https://archive.org/details/algorithmicresol0000smar"><i>The Algorithmic Resolution of Diophantine Equations</i></a></span>. <a href="Cambridge_University_Press" title="Cambridge University Press">Cambridge University Press</a>. <a href="ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <bdi>978-0-521-64633-8</bdi>.</cite></li>

<li><cite id="CITEREFIan_F._Blake,_Gadiel_Seroussi_and_Nigel_P._Smart1999" class="citation book cs1">Ian F. Blake, Gadiel Seroussi and Nigel P. Smart (1999). <i>Elliptic Curves in Cryptography</i>. <a href="Cambridge_University_Press" title="Cambridge University Press">Cambridge University Press</a>. <a href="ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <bdi>978-0-521-65374-9</bdi>.</cite></li>

<li><cite id="CITEREFNigel_P._Smart2002" class="citation book cs1">Nigel P. Smart (2002). <i>Cryptography An Introduction</i>. <a href="McGraw_Hill" class="mw-redirect" title="McGraw Hill">McGraw Hill</a>. <a href="ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <bdi>978-0-07-709987-9</bdi>.</cite></li>

<li><cite id="CITEREFI.F._BlakeG._SeroussiNigel_P._Smart2004" class="citation book cs1">I.F. Blake; G. Seroussi & Nigel P. Smart (2004). <i>Advances in Elliptic Curve Cryptography</i>. <a href="Cambridge_University_Press" title="Cambridge University Press">Cambridge University Press</a>. <a href="ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <bdi>978-0-521-60415-4</bdi>.</cite></li>

<li><cite id="CITEREFNigel_P._Smart2005" class="citation book cs1">Nigel P. Smart, ed. (2005). <i>Cryptography and Coding</i>. <a href="Springer-Verlag" class="mw-redirect" title="Springer-Verlag">Springer-Verlag</a>, <a href="LNCS" class="mw-redirect" title="LNCS">LNCS</a> 3796. <a href="ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <bdi>978-3-540-30276-6</bdi>.</cite></li>

<li><cite id="CITEREFNigel_P._Smart2008" class="citation book cs1">Nigel P. Smart, ed. (2008). <i>Advances in Cryptology - Eurocrypt 2008</i>. Springer-Verlag, LNCS 4965. <a href="ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <bdi>978-3-540-78966-6</bdi>.</cite></li>

<li><cite id="CITEREFDaniel_PageNigel_P._Smart2014" class="citation book cs1">Daniel Page & Nigel P. Smart (2014). <i>What Is Computer Science? An Information Security Perspective</i>. Springer-Verlag. <a href="ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <bdi>978-3-319-04041-7</bdi>.</cite></li>

<li><cite id="CITEREFNigel_P._Smart2015" class="citation book cs1">Nigel P. Smart (2015). <i>Cryptography Made Simple</i>. Springer International Publishing. <a href="ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <bdi>978-3-319-21935-6</bdi>.</cite></li>

<li><cite id="CITEREFArpita_PatraNigel_P._Smart2017" class="citation book cs1">Arpita Patra & Nigel P. Smart (2017). <i>Progress in Cryptology - INDOCRYPT 2017</i>. Springer-Verlag. <a href="ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <bdi>978-3-319-71667-1</bdi>.</cite></li></ul>

<div class="mw-heading mw-heading2"><h2 id="References">References</h2></div>

/* start https://en.wikipedia.org/ */

.mw-parser-output .reflist{margin-bottom:0.5em;list-style-type:decimal}@media screen{.mw-parser-output .reflist{font-size:90%}}.mw-parser-output .reflist .references{font-size:100%;margin-bottom:0;list-style-type:inherit}.mw-parser-output .reflist-columns-2{column-width:30em}.mw-parser-output .reflist-columns-3{column-width:25em}.mw-parser-output .reflist-columns{margin-top:0.3em}.mw-parser-output .reflist-columns ol{margin-top:0}.mw-parser-output .reflist-columns li{page-break-inside:avoid;break-inside:avoid-column}.mw-parser-output .reflist-upper-alpha{list-style-type:upper-alpha}.mw-parser-output .reflist-upper-roman{list-style-type:upper-roman}.mw-parser-output .reflist-lower-alpha{list-style-type:lower-alpha}.mw-parser-output .reflist-lower-greek{list-style-type:lower-greek}.mw-parser-output .reflist-lower-roman{list-style-type:lower-roman}

/* end https://en.wikipedia.org/ */

</style><div class="reflist">

<li id="cite_note-1"><span class="mw-cite-backlink"><b><a href="#cite_ref-1">^</a></b></span> <span class="reference-text"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://www.zama.ai/post/nigel-smart-is-joining-zama-as-chief-academic-officer">"Nigel Smart is joining Zama"</a>.</cite></span>

</li>

<li id="cite_note-2"><span class="mw-cite-backlink"><b><a href="#cite_ref-2">^</a></b></span> <span class="reference-text"><a rel="nofollow" class="external text" href="https://dblp.org/pid/s/NigelPSmart">Nigel P. Smart</a> at <a href="DBLP_(identifier)" class="mw-redirect" title="DBLP (identifier)">DBLP</a> Bibliography Server </span>

</li>

<li id="cite_note-3"><span class="mw-cite-backlink"><b><a href="#cite_ref-3">^</a></b></span> <span class="reference-text"><a rel="nofollow" class="external text" href="https://scholar.google.com/citations?user=Qvm3k64AAAAJ">Nigel Smart</a> publications indexed by <a href="Google_Scholar" title="Google Scholar">Google Scholar</a> </span>

</li>

<li id="cite_note-4"><span class="mw-cite-backlink"><b><a href="#cite_ref-4">^</a></b></span> <span class="reference-text"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://www.iacr.org/elections/2013/">"IACR Election 2013 - List of Candidates and Propositions"</a>. Iacr.org<span class="reference-accessdate">. Retrieved <span class="nowrap">14 August</span> 2015</span>.</cite></span>

</li>

<li id="cite_note-5"><span class="mw-cite-backlink"><b><a href="#cite_ref-5">^</a></b></span> <span class="reference-text"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://www.iacr.org/fellows/2016/">"IACR Fellows 2016"</a>.</cite></span>

</li>

<li id="cite_note-6"><span class="mw-cite-backlink"><b><a href="#cite_ref-6">^</a></b></span> <span class="reference-text">S. D. Galbraith and N. P. Smart, <i>A cryptographic application of the Weil descent,</i> Cryptography and Coding, 1999.</span>

</li>

<li id="cite_note-7"><span class="mw-cite-backlink"><b><a href="#cite_ref-7">^</a></b></span> <span class="reference-text">P. Gaudry, F. Hess, and N. P. Smart, <a rel="nofollow" class="external text" href="http://www.hpl.hp.com/techreports/2000/HPL-2000-10.pdf">Constructive and destructive facets of Weil descent on elliptic curves</a> <a rel="nofollow" class="external text" href="https://web.archive.org/web/20061206133559/http://hpl.hp.com/techreports/2000/HPL-2000-10.pdf">Archived</a> 6 December 2006 at the <a href="Wayback_Machine" title="Wayback Machine">Wayback Machine</a>, Hewlett Packard Laboratories Technical Report, 2000.</span>

</li>

<li id="cite_note-8"><span class="mw-cite-backlink"><b><a href="#cite_ref-8">^</a></b></span> <span class="reference-text">N. Smart, <i>The discrete logarithm problem on elliptic curves of trace one,</i> Journal of Cryptology, Volume 12, 1999.</span>

</li>

<li id="cite_note-9"><span class="mw-cite-backlink"><b><a href="#cite_ref-9">^</a></b></span> <span class="reference-text">Barbosa et al., <a rel="nofollow" class="external text" href="http://grouper.ieee.org/groups/1363/IBC/submissions/Barbosa-SK-KEM-2006-06.pdf">SK-KEM: An Identity-Based KEM</a> <a rel="nofollow" class="external text" href="https://web.archive.org/web/20160303220301/http://grouper.ieee.org/groups/1363/IBC/submissions/Barbosa-SK-KEM-2006-06.pdf">Archived</a> 3 March 2016 at the <a href="Wayback_Machine" title="Wayback Machine">Wayback Machine</a></span>

</li>

<li id="cite_note-10"><span class="mw-cite-backlink"><b><a href="#cite_ref-10">^</a></b></span> <span class="reference-text">F. Hess, N. Smart, F. Vercauteren. The Eta-pairing revisited. In IEEE Transactions on Information Theory, Vol. 52(10), p. 4595-4602, 2006.</span>

</li>

<li id="cite_note-11"><span class="mw-cite-backlink"><b><a href="#cite_ref-11">^</a></b></span> <span class="reference-text">B. Pinkas, T. Schneider, N. P. Smart and S. C. Williams. <i>Secure two-party computation is practical,</i> ASIACRYPT 2009</span>

</li>

<li id="cite_note-12"><span class="mw-cite-backlink"><b><a href="#cite_ref-12">^</a></b></span> <span class="reference-text">I. Damgard, V. Pastro, N. P. Smart, and S. Zakarias. <i>Multiparty computation from somewhat homomorphic encryption,</i> CRYPTO 2012.</span>

</li>

<li id="cite_note-13"><span class="mw-cite-backlink"><b><a href="#cite_ref-13">^</a></b></span> <span class="reference-text">I. Damgard, M. Keller, E. Larraia, C. Miles and N. P. Smart. <i>Implementing AES via an Actively/Covertly Secure Dishonest-Majority MPC Protocol,</i> SCN 2012.</span>

</li>

<li id="cite_note-14"><span class="mw-cite-backlink"><b><a href="#cite_ref-14">^</a></b></span> <span class="reference-text">C. Gentry, S. Halevi and N. P. Smart. <i>Homomorphic Evaluation of the AES Circuit</i> CRYPTO 2012.</span>

</li>

<li id="cite_note-15"><span class="mw-cite-backlink"><b><a href="#cite_ref-15">^</a></b></span> <span class="reference-text"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="http://researcher.watson.ibm.com/researcher/view_group.php?id=5434">"Pat Goldberg Memorial 2012 Best Papers in CS, EE and Math - IBM"</a>. Researcher.watson.ibm.com. 23 March 2015<span class="reference-accessdate">. Retrieved <span class="nowrap">14 August</span> 2015</span>.</cite></span>

</li>

<li id="cite_note-16"><span class="mw-cite-backlink"><b><a href="#cite_ref-16">^</a></b></span> <span class="reference-text"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://web.archive.org/web/20131031101619/http://www.geek.com/news/trend-micro-buys-into-encryption-with-identum-purchase-573095/">"Trend Micro buys into encryption with Identum purchase | News"</a>. Geek.com. 27 February 2008. Archived from <a rel="nofollow" class="external text" href="http://www.geek.com/news/trend-micro-buys-into-encryption-with-identum-purchase-573095/">the original</a> on 31 October 2013<span class="reference-accessdate">. Retrieved <span class="nowrap">14 August</span> 2015</span>.</cite></span>

</li>

<li id="cite_note-17"><span class="mw-cite-backlink"><b><a href="#cite_ref-17">^</a></b></span> <span class="reference-text"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://www.calcalistech.com/ctech/articles/0,7340,L-3923738,00.html">"Crypto giant Coinbase acquiring Israel's Unbound Security"</a>. 30 November 2012<span class="reference-accessdate">. Retrieved <span class="nowrap">1 December</span> 2021</span>.</cite></span>

</li>

<li id="cite_note-18"><span class="mw-cite-backlink"><b><a href="#cite_ref-18">^</a></b></span> <span class="reference-text"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://rwc.iacr.org/">"Real World Crypto Symposium"</a>. 1 January 2018<span class="reference-accessdate">. Retrieved <span class="nowrap">18 January</span> 2018</span>.</cite></span>

</li>

</ol></div></div>

/* start https://en.wikipedia.org/ */

.mw-parser-output .hlist dl,.mw-parser-output .hlist ol,.mw-parser-output .hlist ul{margin:0;padding:0}.mw-parser-output .hlist dd,.mw-parser-output .hlist dt,.mw-parser-output .hlist li{margin:0;display:inline}.mw-parser-output .hlist.inline,.mw-parser-output .hlist.inline dl,.mw-parser-output .hlist.inline ol,.mw-parser-output .hlist.inline ul,.mw-parser-output .hlist dl dl,.mw-parser-output .hlist dl ol,.mw-parser-output .hlist dl ul,.mw-parser-output .hlist ol dl,.mw-parser-output .hlist ol ol,.mw-parser-output .hlist ol ul,.mw-parser-output .hlist ul dl,.mw-parser-output .hlist ul ol,.mw-parser-output .hlist ul ul{display:inline}.mw-parser-output .hlist .mw-empty-li{display:none}.mw-parser-output .hlist dt::after{content:": "}.mw-parser-output .hlist dd::after,.mw-parser-output .hlist li::after{content:" · ";font-weight:bold}.mw-parser-output .hlist dd:last-child::after,.mw-parser-output .hlist dt:last-child::after,.mw-parser-output .hlist li:last-child::after{content:none}.mw-parser-output .hlist dd dd:first-child::before,.mw-parser-output .hlist dd dt:first-child::before,.mw-parser-output .hlist dd li:first-child::before,.mw-parser-output .hlist dt dd:first-child::before,.mw-parser-output .hlist dt dt:first-child::before,.mw-parser-output .hlist dt li:first-child::before,.mw-parser-output .hlist li dd:first-child::before,.mw-parser-output .hlist li dt:first-child::before,.mw-parser-output .hlist li li:first-child::before{content:" (";font-weight:normal}.mw-parser-output .hlist dd dd:last-child::after,.mw-parser-output .hlist dd dt:last-child::after,.mw-parser-output .hlist dd li:last-child::after,.mw-parser-output .hlist dt dd:last-child::after,.mw-parser-output .hlist dt dt:last-child::after,.mw-parser-output .hlist dt li:last-child::after,.mw-parser-output .hlist li dd:last-child::after,.mw-parser-output .hlist li dt:last-child::after,.mw-parser-output .hlist li li:last-child::after{content:")";font-weight:normal}.mw-parser-output .hlist ol{counter-reset:listitem}.mw-parser-output .hlist ol>li{counter-increment:listitem}.mw-parser-output .hlist ol>li::before{content:" "counter(listitem)"\a0 "}.mw-parser-output .hlist dd ol>li:first-child::before,.mw-parser-output .hlist dt ol>li:first-child::before,.mw-parser-output .hlist li ol>li:first-child::before{content:" ("counter(listitem)"\a0 "}

/* end https://en.wikipedia.org/ */

</style><style data-mw-deduplicate="TemplateStyles:r1236075235">

/* start https://en.wikipedia.org/ */

.mw-parser-output .navbox{box-sizing:border-box;border:1px solid #a2a9b1;width:100%;clear:both;font-size:88%;text-align:center;padding:1px;margin:1em auto 0}.mw-parser-output .navbox .navbox{margin-top:0}.mw-parser-output .navbox+.navbox,.mw-parser-output .navbox+.navbox-styles+.navbox{margin-top:-1px}.mw-parser-output .navbox-inner,.mw-parser-output .navbox-subgroup{width:100%}.mw-parser-output .navbox-group,.mw-parser-output .navbox-title,.mw-parser-output .navbox-abovebelow{padding:0.25em 1em;line-height:1.5em;text-align:center}.mw-parser-output .navbox-group{white-space:nowrap;text-align:right}.mw-parser-output .navbox,.mw-parser-output .navbox-subgroup{background-color:#fdfdfd}.mw-parser-output .navbox-list{line-height:1.5em;border-color:#fdfdfd}.mw-parser-output .navbox-list-with-group{text-align:left;border-left-width:2px;border-left-style:solid}.mw-parser-output tr+tr>.navbox-abovebelow,.mw-parser-output tr+tr>.navbox-group,.mw-parser-output tr+tr>.navbox-image,.mw-parser-output tr+tr>.navbox-list{border-top:2px solid #fdfdfd}.mw-parser-output .navbox-title{background-color:#ccf}.mw-parser-output .navbox-abovebelow,.mw-parser-output .navbox-group,.mw-parser-output .navbox-subgroup .navbox-title{background-color:#ddf}.mw-parser-output .navbox-subgroup .navbox-group,.mw-parser-output .navbox-subgroup .navbox-abovebelow{background-color:#e6e6ff}.mw-parser-output .navbox-even{background-color:#f7f7f7}.mw-parser-output .navbox-odd{background-color:transparent}.mw-parser-output .navbox .hlist td dl,.mw-parser-output .navbox .hlist td ol,.mw-parser-output .navbox .hlist td ul,.mw-parser-output .navbox td.hlist dl,.mw-parser-output .navbox td.hlist ol,.mw-parser-output .navbox td.hlist ul{padding:0.125em 0}.mw-parser-output .navbox .navbar{display:block;font-size:100%}.mw-parser-output .navbox-title .navbar{float:left;text-align:left;margin-right:0.5em}body.skin--responsive .mw-parser-output .navbox-image img{max-width:none!important}@media print{body.ns-0 .mw-parser-output .navbox{display:none!important}}

/* end https://en.wikipedia.org/ */

</style><style data-mw-deduplicate="TemplateStyles:r1038841319">

/* start https://en.wikipedia.org/ */

.mw-parser-output .tooltip-dotted{border-bottom:1px dotted;cursor:help}

/* end https://en.wikipedia.org/ */

</style></div><div role="navigation" class="navbox authority-control" aria-labelledby="Authority_control_databases_frameless&#124;text-top&#124;10px&#124;alt=Edit_this_at_Wikidata&#124;link=https&#58;//www.wikidata.org/wiki/Q1476239#identifiers&#124;class=noprint&#124;Edit_this_at_Wikidata2834" style="padding:3px"><table class="nowraplinks hlist mw-collapsible autocollapse navbox-inner" style="border-spacing:0;background:transparent;color:inherit"><tbody><tr><th scope="col" class="navbox-title" colspan="2"><div id="Authority_control_databases_frameless&#124;text-top&#124;10px&#124;alt=Edit_this_at_Wikidata&#124;link=https&#58;//www.wikidata.org/wiki/Q1476239#identifiers&#124;class=noprint&#124;Edit_this_at_Wikidata2834" style="font-size:114%;margin:0 4em">Authority control databases </div></th></tr><tr><th scope="row" class="navbox-group" style="width:1%">International</th><td class="navbox-list-with-group navbox-list navbox-odd" style="width:100%;padding:0"><div style="padding:0 0.25em"><ul><li><span class="uid"><a rel="nofollow" class="external text" href="https://isni.org/isni/0000000114377843">ISNI</a></span></li><li><span class="uid"><a rel="nofollow" class="external text" href="https://viaf.org/viaf/10714160">VIAF</a></span></li><li><span class="uid"><a rel="nofollow" class="external text" href="https://id.oclc.org/worldcat/entity/E39PBJrrtbftpYVPQTWWxvVV4q">WorldCat</a></span></li></ul></div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%">National</th><td class="navbox-list-with-group navbox-list navbox-even" style="width:100%;padding:0"><div style="padding:0 0.25em"><ul><li><span class="uid"><a rel="nofollow" class="external text" href="https://d-nb.info/gnd/173244815">Germany</a></span></li><li><span class="uid"><a rel="nofollow" class="external text" href="https://id.loc.gov/authorities/n98044589">United States</a></span></li><li><span class="uid"><a rel="nofollow" class="external text" href="https://catalogue.bnf.fr/ark:/12148/cb16741032w">France</a></span></li><li><span class="uid"><a rel="nofollow" class="external text" href="https://data.bnf.fr/ark:/12148/cb16741032w">BnF data</a></span></li><li><span class="uid"><a rel="nofollow" class="external text" href="https://id.ndl.go.jp/auth/ndlna/00864608">Japan</a></span></li><li><span class="uid"><a rel="nofollow" class="external text" href="https://aleph.nkp.cz/F/?func=find-c&local_base=aut&ccl_term=ica=xx0041531&CON_LNG=ENG">Czech Republic</a></span></li><li><span class="uid"><a rel="nofollow" class="external text" href="http://data.bibliotheken.nl/id/thes/p11665385X">Netherlands</a></span></li><li><span class="uid"><span class="rt-commentedText tooltip tooltip-dotted" title="Smart, Nigel P., 1967-"><a rel="nofollow" class="external text" href="https://kopkatalogs.lv/F?func=direct&local_base=lnc10&doc_number=000258310&P_CON_LNG=ENG">Latvia</a></span></span></li><li><span class="uid"><a rel="nofollow" class="external text" href="https://dbn.bn.org.pl/descriptor-details/9810558139905606">Poland</a></span></li><li><span class="uid"><a rel="nofollow" class="external text" href="https://www.nli.org.il/en/authorities/987007591201005171">Israel</a></span></li></ul></div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%">Academics</th><td class="navbox-list-with-group navbox-list navbox-odd" style="width:100%;padding:0"><div style="padding:0 0.25em"><ul><li><span class="uid"><a rel="nofollow" class="external text" href="https://ci.nii.ac.jp/author/DA11775794?l=en">CiNii</a></span></li><li><span class="uid"><a rel="nofollow" class="external text" href="https://orcid.org/0000-0003-3567-3304">ORCID</a></span></li><li><span class="uid"><a rel="nofollow" class="external text" href="https://www.mathgenealogy.org/id.php?id=46520">Mathematics Genealogy Project</a></span></li><li><span class="uid"><a rel="nofollow" class="external text" href="https://dl.acm.org/profile/81318496259">Association for Computing Machinery</a></span></li><li><span class="uid"><a rel="nofollow" class="external text" href="https://zbmath.org/authors/?q=ai:smart.nigel-paul">zbMATH</a></span></li><li><span class="uid"><a rel="nofollow" class="external text" href="https://scholar.google.com/citations?user=Qvm3k64AAAAJ">Google Scholar</a></span></li><li><span class="uid"><a rel="nofollow" class="external text" href="https://dblp.org/pid/s/NigelPSmart">DBLP</a></span></li><li><span class="uid"><a rel="nofollow" class="external text" href="https://mathscinet.ams.org/mathscinet/MRAuthorID/329225">MathSciNet</a></span></li></ul></div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%">People</th><td class="navbox-list-with-group navbox-list navbox-even" style="width:100%;padding:0"><div style="padding:0 0.25em"><ul><li><span class="uid"><a rel="nofollow" class="external text" href="https://www.deutsche-digitale-bibliothek.de/person/gnd/173244815">DDB</a></span></li></ul></div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%">Other</th><td class="navbox-list-with-group navbox-list navbox-odd" style="width:100%;padding:0"><div style="padding:0 0.25em"><ul><li><span class="uid"><a rel="nofollow" class="external text" href="https://www.idref.fr/073769509">IdRef</a></span></li><li><span class="uid"><a rel="nofollow" class="external text" href="https://lux.collections.yale.edu/view/person/6bfec201-b2b7-4c96-aecd-340d6e5284e9">Yale LUX</a></span></li></ul></div></td></tr></tbody></table></div></div><div><div class="zim-footer">

This article is issued from <a class="external text" title="Last edited on 2025-06-18" href="https://en.wikipedia.org/wiki/?title=Nigel_Smart_(cryptographer)&oldid=1296181314">Wikipedia</a>. The text is available under <a class="external text" href="https://creativecommons.org/licenses/by-sa/4.0/deed.en">Creative Commons Attribution-Share Alike 4.0</a> unless otherwise noted. Additional terms may apply for the media files.

</div>

</div></div>

</div>

</main>

</div>

</body></html>